Composite matrices from group rings, composite G-codes and constructions of self-dual codes
نویسندگان
چکیده
Abstract In this work, we define composite matrices which are derived from group rings. We extend the idea of G -codes to -codes. show that these codes ideals in a ring, where ring is finite commutative Frobenius and an arbitrary group. prove dual -code also -code. quasi-composite Additionally, study generator matrices, consist identity matrices. Together with well known extension method, neighbour method its generalization, find extremal binary self-dual length 68 new weight enumerators for rare parameters $$\gamma =7,8$$ ? = 7 , 8 9. particular, 49 such codes. Moreover, inaccessible other construction
منابع مشابه
Constructions of Self-Dual and Formally Self-Dual Codes from Group Rings
We give constructions of self-dual and formally self-dual codes from group rings where the ring is a finite commutative Frobenius ring. We improve the existing construction given in [11] by showing that one of the conditions given in the theorem is unnecessary and moreover it restricts the number of self-dual codes obtained by the construction. We show that several of the standard constructions...
متن کاملVarious constructions for self-dual codes over rings and new binary self-dual codes
In this work, we propose a modified four circulant construction for self-dual codes and a bordered version of the construction using the properties of λ-circulant and λ-reverse circulant matrices. By using the constructions on F2, we obtain new binary codes of lengths 64 and 68. We also apply the constructions to the ring R2 and considering the F2 and R1-extensions, we obtain new singly-even ex...
متن کاملConstructions of self-dual codes over finite commutative chain rings
We study self-dual codes over chain rings. We describe a technique for constructing new self-dual codes from existing codes and we prove that for chain rings containing an element c with c = −1 all self-dual codes can be constructed by this technique. We extend this construction to self-dual codes over principal ideal rings via the Chinese Remainder Theorem. We use torsion codes to describe the...
متن کاملArithmetic Constructions Of Binary Self-Dual Codes
The goal of this thesis is to explore the interplay between binary self-dual codes and the \'etale cohomology of arithmetic schemes. Three constructions of binary self-dual codes with arithmetic origins are proposed and compared: Construction $\Q$, Construction G and the Equivariant Construction. In this thesis, we prove that up to equivalence, all binary self-dual codes of length at least $4$ ...
متن کاملMDS and self-dual codes over rings
In this paper we give the structure of constacyclic codes over formal power series and chain rings. We also present necessary and sufficient conditions on the existence of MDS codes over principal ideal rings. These results allow for the construction of infinite families of MDS self-dual codes over finite chain rings, formal power series and principal ideal rings.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2021
ISSN: ['0925-1022', '1573-7586']
DOI: https://doi.org/10.1007/s10623-021-00882-8